-
1 branch-bound algorithm
testing algorithm — алгоритм тестирования; алгоритм проверки
simulated annealing algorithm — алгоритм модельной "закалки"
-
2 branch-bound algorithm
Большой англо-русский и русско-английский словарь > branch-bound algorithm
-
3 branch-bound algorithm
Вычислительная техника: алгоритм метода ветвей и границУниверсальный англо-русский словарь > branch-bound algorithm
-
4 branch-bound algorithm
English-Russian dictionary of computer science and programming > branch-bound algorithm
-
5 branch bound
-
6 branch bound
-
7 branch and bound algorithm
English-Russian dictionary of Information technology > branch and bound algorithm
-
8 branch-and-bound algorithm
Большой англо-русский и русско-английский словарь > branch-and-bound algorithm
-
9 branch-and-bound algorithm
Англо-русский словарь технических терминов > branch-and-bound algorithm
-
10 branch and bound algorithm
1) Компьютерная техника: метод ветвей и границ2) Вычислительная техника: алгоритм ветвей и границ3) Микроэлектроника: алгоритм метода ветвей и границ4) Макаров: метод ветвей и границ (метод оптимизации)Универсальный англо-русский словарь > branch and bound algorithm
-
11 branch-and-bound algorithm
1) Техника: алгоритм метода ветвей и границ2) Математика: алгоритм ветвей и границ (метода)Универсальный англо-русский словарь > branch-and-bound algorithm
-
12 branch and bound algorithm
English-Russian electronics dictionary > branch and bound algorithm
-
13 branch and bound algorithm
The New English-Russian Dictionary of Radio-electronics > branch and bound algorithm
-
14 branch and bound algorithm
Англо-русский словарь компьютерных и интернет терминов > branch and bound algorithm
-
15 branch and bound algorithm
English-Russian dictionary of terms that are used in computer games > branch and bound algorithm
-
16 branch-and-bound algorithm
English-Russian scientific dictionary > branch-and-bound algorithm
-
17 branch(-and)-bound algorithm
The English-Russian dictionary on reliability and quality control > branch(-and)-bound algorithm
-
18 algorithm
- ad hoc algorithm
- adaptive algorithm
- aim algorithm
- algorithm for path connections
- automatic assessment algorithm
- back-propagation algorithm
- banker's algorithm
- best-route algorithm
- bicomponent algorithm
- bipartitioning algorithm
- bisection algorithm
- branch-bound algorithm
- branching algorithm
- cascading algorithm
- chain algorithm
- channel router algorithm
- coarse-to-fine algorithm
- column sweep algorithm
- combinatorial algorithm
- computational algorithm
- computing algorithm
- conservative algorithm
- control algorithm
- convergent algorithm
- curve-fitting algorithm
- cutting-plane algorithm
- D-algorithm
- decision algorithm
- decoding algorithm
- demand-paging algorithm
- deterministic algorithm
- digit-by-digit algorithm
- divide-and-conquer algorithm
- double-sweep algorithm
- draphics algorithm
- drawing algorithm
- DSP algorithm
- dual algorithm
- durable algorithm
- earliest-deadline-first algorithm
- edge-based algorithm
- event-scheduling algorithm
- exchange algorithm
- fault-handling algorithm
- fine-to-coarse algorithm
- fixed-stealing algorithm
- fixed-step-size algorithm
- flow-synthesis algorithm
- forward-looking algorithm
- generalized algorithm
- genetic algorithm
- Goto algorithm
- graph algorithm
- graph traversal algorithm
- greedy algorithm
- grid expansion algorithm
- hardware algorithm
- heuristic algorithm
- Hightower algorithm
- incorrect algorithm
- inference-based algorithm
- inferencing algorithm
- instruction issue algorithm
- integer algorithm
- integrated query optimization algorithm
- iteration algorithm
- iterative algorithm
- layout algorithm
- layout copmaction algorithm
- leaky bucket algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-expansion algorithm
- Lee-type algorithm
- levelization algorithm
- linear expansion algorithm
- line-placing algorithm
- line-probe algorithm
- logical algorithm
- mathematically based algorithm
- mathematically intensive algorithm
- maximum matching algorithm
- mesh algorithm - minimum path-length algorithm
- modeling algorithm
- multikey algorithm
- multipass algorithm
- nested algorithm
- network algorithm
- normal algorithm
- no-wait algorithm
- operative algorithm
- optimal assignment algorithm
- optimal cutting algorithm
- ordering algorithm
- page-replacement algorithm
- paging algorithm
- parallel algorithm
- partitioning algorithm
- path-tracing algorithm
- pipeline algorithm
- pitch algorithm
- placement algorithm
- prediction algorithm
- primal-dual algorithm
- primary algorithm
- problem algorithm
- procrastination algorithm
- public-key algorithm
- quorum-based algorithm
- random search algorithm
- recognition algorithm
- recursive algorithm
- relaxation algorithm
- replicate algorithm
- robust algorithm
- round-robin algorithm
- routing algorithm
- scanline algorithm
- scheduling algorithm
- sequential algorithm
- shortest path algorithm
- shrinking algorithm
- simplex algorithm
- simulated annealing algorithm
- software algorithm
- spanning tree algorithm
- speech generation algorithm
- speed-enhancing algorithm
- square rooting algorithm
- steepest ascent algorithm
- systolic algorithm
- testing algorithm
- text-to-speech algorithm
- threshold decoding algorithm
- timetable scheduling algorithm
- trace back algorithm
- translation algorithm
- transportation algorithm
- tree-search algorithm
- two-dimensional placement algorithm
- two-list algorithm
- type-inferencing algorithm
- unconstrained minimization algorithm
- universal algorithm
- variable-stealing algorithm
- Vintr algorithm
- VLSI algorithm
- write-back algorithmEnglish-Russian dictionary of computer science and programming > algorithm
-
19 bound
1. a c2. a обязанный, вынужденный3. a непременный, обязательный4. a амер. разг. решившийся; намеренный5. a спец. несвободный, связанный6. a переплетённый, в переплёте7. a мед. проф. страдающий запором8. n прыжок, скачок9. n воен. перебежка10. n отскокto catch a ball on the bound — поймать мяч, как только он отскочит
11. n воен. рикошет12. n поэт. сильный удар сердца13. v прыгать, скакать; быстро бежать, нестись14. v воен. отскакивать, рикошетировать15. n книжн. граница, предел16. n обыкн. предел, границы, рамки17. n обыкн. определённый район,18. n зона19. v ограничивать, служить границей20. v амер. называть, указывать границы21. v ограничивать, сдерживать22. a predic готовый; направляющийсяa ship bound for a voyage — корабль, готовый к отплытию
a ship bound for London — судно, направляющееся в Лондон
23. a predic как компонент сложных слов направляющийсяСинонимический ряд:1. apprenticed (adj.) apprenticed; articled; indentured2. constipated (adj.) astricted; constipated; costive; obstipated3. constrained (adj.) compelled; constrained; fettered; impelled4. finite (adj.) bounded; finite; limited5. going (adj.) destined; directed; going6. obliged (adj.) beholden; indebted; obligated; obliged7. border (noun) border; boundary; brim; confines; end; limit; limitation; mete; precinct; term; verge8. spring (noun) bounce; jump; leap; rebound; spring9. associated (verb) affiliated; allied; associated; combined; connected; joined; linked; related10. border (verb) border; define; edge; fringe; hem; margin; outline; skirt; surround; verge11. charged (verb) charged; committed; obligated; pledged12. demarcate (verb) delimit; delimitate; demarcate; determine; limit; mark out; measure13. dressed (verb) bandaged; bound; dressed14. jump (verb) hop; hurdle; jump; leap; lop; saltate; spring; vault15. meet (verb) abut; adjoin; butt; juxtapose; meet; neighbour; touch16. rebound (verb) bounce; rebound; recoil; ricochet17. restrict (verb) circle; confine; restrict; rim; set limits; terminate18. tied (verb) fastened; knotted; secured; tie up; tied; tied upАнтонимический ряд: -
20 branch-and-bound
метод ветвей и границ - branch-and-bound algorithm - branch-and-bound method - branch-and-bound principle - branch-and-bound procedureБольшой англо-русский и русско-английский словарь > branch-and-bound
- 1
- 2
См. также в других словарях:
Branch and bound — (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of… … Wikipedia
Branch and cut — (sometimes written as branch and cut ) is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is a hybrid of… … Wikipedia
Branch-and-Bound — (Verzweigung und Schranke) ist eine im Bereich Operations Research häufig verwendete mathematische Methode, deren Ziel darin besteht, für ein gegebenes ganzzahliges Optimierungsproblem eine beste Lösung zu finden. Branch and Bound führt auf einen … Deutsch Wikipedia
Branch and Bound — (Verzweigung und Schranke) ist eine im Bereich Operations Research häufig verwendete mathematische Methode, deren Ziel darin besteht, für ein gegebenes ganzzahliges Optimierungsproblem eine beste Lösung zu finden. Branch and Bound führt auf einen … Deutsch Wikipedia
Branch and bound — (Verzweigung und Schranke) ist eine im Bereich Operations Research häufig verwendete mathematische Methode, deren Ziel darin besteht, für ein gegebenes ganzzahliges Optimierungsproblem eine beste Lösung zu finden. Branch and Bound führt auf einen … Deutsch Wikipedia
Branch and price — est une méthode d optimisation combinatoire pour résoudre des problèmes d optimisation linéaire en nombres entiers. Cette méthode combine l algorithme du branch and bound classique avec une génération de colonnes à chaque nœud de l arbre.… … Wikipédia en Français
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Levenberg–Marquardt algorithm — In mathematics and computing, the Levenberg–Marquardt algorithm (LMA)[1] provides a numerical solution to the problem of minimizing a function, generally nonlinear, over a space of parameters of the function. These minimization problems arise… … Wikipedia
Gauss–Newton algorithm — The Gauss–Newton algorithm is a method used to solve non linear least squares problems. It can be seen as a modification of Newton s method for finding a minimum of a function. Unlike Newton s method, the Gauss–Newton algorithm can only be used… … Wikipedia
Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a word W within a main text string S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to… … Wikipedia